Two trees which are self-intersecting when drawn simultaneously
نویسندگان
چکیده
منابع مشابه
Which trees are link graphs?
The link of a vertex v of a graph G is the subgraph induced by all vertices adjacent to U. If all the links of G are isomorphic to L, then G has constant link and L is called a link graph. We investigate the trees of order p < 9 to see which are link graphs. Group theoretic methods are used to obtain constructions of graphs G with constant link L for certain trees L. Necessary conditions are de...
متن کاملSouslin Trees Which Are Hard to Specialise
We construct some +-Souslin trees which cannot be specialised by any forcing which preserves cardinals and coonalities. For a regular cardinal we use the principle, for singular we use squares and diamonds.
متن کاملWhen two trees go to war.
Rooted phylogenetic networks are used to model non-treelike evolutionary histories. Such networks are often constructed by combining trees, clusters, triplets or characters into a single network that in some well-defined sense simultaneously represents them all. We review these four models and investigate how they are related. Motivated by the parsimony principle, one often aims to construct a ...
متن کاملA Model in Which There Are Jech–kunen Trees but There Are No Kurepa Trees
By an ω1–tree we mean a tree of power ω1 and height ω1. We call an ω1–tree a Jech–Kunen tree if it has κ–many branches for some κ strictly between ω1 and 21 . In this paper we construct the models of CH plus 21 > ω2, in which there are Jech–Kunen trees and there are no Kurepa trees. An partially ordered set, or poset for short, 〈T,<T 〉 is called a tree if for every t ∈ T the set {s ∈ T : s <T t...
متن کاملWhich Spatial Partition Trees are Adaptive to Intrinsic Dimension?
Recent theory work has found that a special type of spatial partition tree – called a random projection tree – is adaptive to the intrinsic dimension of the data from which it is built. Here we examine this same question, with a combination of theory and experiments, for a broader class of trees that includes k-d trees, dyadic trees, and PCA trees. Our motivation is to get a feel for (i) the ki...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.01.033